p(a(x0), p(b(x1), p(a(x2), x3))) → p(x2, p(a(a(x0)), p(b(x1), x3)))
↳ QTRS
↳ DependencyPairsProof
p(a(x0), p(b(x1), p(a(x2), x3))) → p(x2, p(a(a(x0)), p(b(x1), x3)))
P(a(x0), p(b(x1), p(a(x2), x3))) → P(a(a(x0)), p(b(x1), x3))
P(a(x0), p(b(x1), p(a(x2), x3))) → P(b(x1), x3)
P(a(x0), p(b(x1), p(a(x2), x3))) → P(x2, p(a(a(x0)), p(b(x1), x3)))
p(a(x0), p(b(x1), p(a(x2), x3))) → p(x2, p(a(a(x0)), p(b(x1), x3)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
P(a(x0), p(b(x1), p(a(x2), x3))) → P(a(a(x0)), p(b(x1), x3))
P(a(x0), p(b(x1), p(a(x2), x3))) → P(b(x1), x3)
P(a(x0), p(b(x1), p(a(x2), x3))) → P(x2, p(a(a(x0)), p(b(x1), x3)))
p(a(x0), p(b(x1), p(a(x2), x3))) → p(x2, p(a(a(x0)), p(b(x1), x3)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
P(a(x0), p(b(x1), p(a(x2), x3))) → P(a(a(x0)), p(b(x1), x3))
P(a(x0), p(b(x1), p(a(x2), x3))) → P(x2, p(a(a(x0)), p(b(x1), x3)))
p(a(x0), p(b(x1), p(a(x2), x3))) → p(x2, p(a(a(x0)), p(b(x1), x3)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
P(a(x0), p(b(x1), p(a(x2), x3))) → P(a(a(x0)), p(b(x1), x3))
Used ordering: Polynomial interpretation [25,35]:
P(a(x0), p(b(x1), p(a(x2), x3))) → P(x2, p(a(a(x0)), p(b(x1), x3)))
The value of delta used in the strict ordering is 1/16.
POL(P(x1, x2)) = (1/4)x_2
POL(a(x1)) = 0
POL(p(x1, x2)) = 1/4 + x_2
POL(b(x1)) = 0
p(a(x0), p(b(x1), p(a(x2), x3))) → p(x2, p(a(a(x0)), p(b(x1), x3)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
P(a(x0), p(b(x1), p(a(x2), x3))) → P(x2, p(a(a(x0)), p(b(x1), x3)))
p(a(x0), p(b(x1), p(a(x2), x3))) → p(x2, p(a(a(x0)), p(b(x1), x3)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
P(a(x0), p(b(x1), p(a(x2), x3))) → P(x2, p(a(a(x0)), p(b(x1), x3)))
The value of delta used in the strict ordering is 6/1.
POL(P(x1, x2)) = (2)x_1 + (2)x_2
POL(a(x1)) = 1 + (1/4)x_1
POL(p(x1, x2)) = x_1 + (4)x_2
POL(b(x1)) = 1/4
p(a(x0), p(b(x1), p(a(x2), x3))) → p(x2, p(a(a(x0)), p(b(x1), x3)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
p(a(x0), p(b(x1), p(a(x2), x3))) → p(x2, p(a(a(x0)), p(b(x1), x3)))